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:25Elijah KinElijah KinScore: 66,413Success
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:1266,325577,559,561493,551,00056,948,0002,285,568
2Mar 14, 2026 18:2566,343578,513,460502,682,00047,969,0002,285,568
3Mar 14, 2026 18:1266,356571,800,013504,778,00045,979,0002,506,752
4Mar 14, 2026 18:1266,413576,579,243500,299,00050,928,0002,285,568
5Mar 14, 2026 18:2566,535572,937,136483,213,00069,030,0002,506,752
6Mar 14, 2026 18:2566,554579,306,238498,362,00054,039,0002,506,752