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 listMay 3, 2026 19:57TudyMTudyMScore: 34,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:0234,506303,113,946285,397,0001,006,0002,383,872
2May 3, 2026 20:0234,520302,822,304285,511,0001,006,0002,379,776
3May 3, 2026 20:0234,522303,755,589285,530,0001,004,0002,375,680
4May 3, 2026 20:0234,534303,302,489285,628,0001,007,0002,379,776
5May 3, 2026 20:0234,536301,966,114285,646,0001,005,0002,383,872
6May 3, 2026 20:0234,537306,390,035285,659,0001,006,0002,383,872
7May 3, 2026 20:0234,546305,020,587285,731,0001,006,0002,379,776
8May 3, 2026 20:0234,559306,880,296285,840,0001,005,0002,379,776
9May 3, 2026 20:0234,651304,590,073286,605,0001,006,0002,375,680