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 listSep 11, 2026 18:22Victor MerckléVictor MerckléScore: 31,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 18:2831,156267,269,867257,597,0001,004,00024,576stderr
2Sep 11, 2026 18:2831,210267,675,027257,999,0001,046,00024,576stderr
3Sep 11, 2026 18:2831,257268,161,784257,386,0002,052,00024,576stderr
4Sep 11, 2026 18:2831,347268,981,040257,207,0002,974,0002,117,632stderr
5Sep 11, 2026 18:2831,448269,719,937258,381,0002,645,00024,576stderr
6Sep 11, 2026 18:2831,461269,821,291258,940,0002,191,0002,117,632stderr
7Sep 11, 2026 18:2832,905282,455,141258,482,00014,632,0002,117,632stderr
8Sep 11, 2026 18:2833,430286,201,708259,605,00017,872,0002,117,632stderr
9Sep 11, 2026 18:2834,188292,486,658259,367,00024,399,0002,117,632stderr