Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJan 1, 2026 21:03Josu San MartinJosu San MartinScore: 6,521Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 21:036,18078,199,63748,273,0003,017,0002,330,624
2Jan 1, 2026 21:036,19376,641,98149,386,0002,015,0002,510,848
3Jan 1, 2026 21:036,20878,483,74247,486,0004,041,0002,379,776
4Jan 1, 2026 21:036,52187,050,06652,121,0002,004,0002,498,560
5Jan 1, 2026 21:036,54582,758,85352,312,0002,012,0002,269,184
6Jan 1, 2026 21:036,54680,001,77950,307,0004,024,0002,473,984