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 14, 2026 18:45Elijah KinElijah KinScore: 65,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 18:4565,603572,542,208484,557,00059,945,0002,412,544
2Mar 14, 2026 18:4565,657570,110,821487,955,00056,994,0002,285,568
3Mar 14, 2026 18:4565,670576,253,430491,054,00054,005,0002,285,568
4Mar 14, 2026 18:4565,694571,826,128490,231,00055,026,0002,281,472
5Mar 14, 2026 18:4565,747570,879,233491,729,00053,970,0002,412,544
6Mar 14, 2026 18:4565,771569,045,009486,912,00058,989,0002,420,736
7Mar 14, 2026 18:4565,789578,332,483485,153,00060,893,0002,408,448
8Mar 14, 2026 18:4565,839571,124,938498,514,00047,953,0002,404,352
9Mar 14, 2026 18:4566,059581,623,646499,351,00048,936,0002,285,568