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 listSep 12, 2026 15:01Kevin HeaveyKevin HeaveyScore: 56,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 15:0156,021475,222,221463,863,0001,119,0002,117,632
2Sep 12, 2026 15:0156,093475,859,089464,404,0001,169,0002,117,632
3Sep 12, 2026 15:0156,164476,421,328465,029,0001,137,0002,117,632
4Sep 12, 2026 15:0156,166476,526,385465,034,0001,150,0002,117,632
5Sep 12, 2026 15:0156,186476,666,381465,346,0001,005,0002,117,632
6Sep 12, 2026 15:0156,195476,734,453465,235,0001,188,0002,117,632
7Sep 12, 2026 15:0156,218476,897,740465,413,0001,201,0002,117,632
8Sep 12, 2026 15:0156,260477,227,235465,823,0001,136,0002,117,632
9Sep 12, 2026 15:0156,333477,835,444466,426,0001,141,0002,117,632