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:23Elijah KinElijah KinScore: 68,782Success
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:1868,575594,052,702512,156,00057,017,0002,502,656
2Mar 14, 2026 18:2368,681591,987,283508,047,00062,005,0002,506,752
3Mar 14, 2026 18:1868,700593,497,477511,189,00059,021,0002,281,472
4Mar 14, 2026 18:1868,782596,593,471511,903,00058,988,0002,285,568
5Mar 14, 2026 18:2368,803594,207,481521,056,00050,005,0002,277,376
6Mar 14, 2026 18:2368,864597,300,584525,604,00045,965,0002,514,944