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 25, 2026 19:07Mandar BapatMandar BapatScore: 2,069,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 19:072,064,16817,173,205,64117,065,622,00066,971,0002,281,472
2Mar 25, 2026 19:072,067,68617,199,772,02217,080,831,00080,961,0002,293,760
3Mar 25, 2026 19:072,068,32717,206,824,46517,102,145,00064,966,0002,285,568
4Mar 25, 2026 19:072,068,38017,196,401,22317,103,579,00063,975,0002,289,664
5Mar 25, 2026 19:072,069,91217,210,862,42217,115,300,00064,966,0002,510,848
6Mar 25, 2026 19:072,071,78817,230,753,32717,124,872,00070,970,0002,289,664
7Mar 25, 2026 19:072,072,68017,238,835,94317,128,279,00074,966,0002,281,472
8Mar 25, 2026 19:072,082,42717,328,610,44917,195,198,00088,944,0002,293,760
9Mar 25, 2026 19:072,129,53517,706,556,06917,613,165,00061,972,0002,269,184