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 listMar 29, 2026 14:48Danylo MocherniukDanylo MocherniukScore: 11,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 14:4811,574116,543,54994,063,0002,001,0002,293,760
2Mar 29, 2026 14:4811,576118,587,35094,076,0002,001,0002,506,752
3Mar 29, 2026 14:4811,578122,431,80694,093,0002,001,0002,293,760
4Mar 29, 2026 14:4811,579119,417,96894,100,0002,002,0002,510,848
5Mar 29, 2026 14:4811,583121,470,66794,134,0002,002,0002,506,752
6Mar 29, 2026 14:4811,603124,351,97295,302,0001,003,0002,293,760
7Mar 29, 2026 14:4811,604125,831,21594,308,0002,006,0002,289,664
8Mar 29, 2026 14:4811,630124,876,19895,527,0001,005,0002,293,760
9Mar 29, 2026 14:4811,664128,702,85794,817,0001,996,0002,293,760