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 14, 2026 00:16drewbumpasdrewbumpasScore: 79,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:1778,805664,350,613567,112,00086,970,0002,113,536
2Sep 14, 2026 00:1778,876664,970,750567,356,00087,323,0002,113,536
3Sep 14, 2026 00:1778,941665,573,755567,563,00087,651,0002,113,536
4Sep 14, 2026 00:1778,965666,312,747567,673,00087,741,0002,113,536
5Sep 14, 2026 00:1779,000666,524,395567,535,00088,171,0002,113,536
6Sep 14, 2026 00:1779,037666,202,156567,927,00088,087,0002,113,536
7Sep 14, 2026 00:1779,045666,312,774567,585,00088,491,0002,113,536
8Sep 14, 2026 00:1779,131667,720,902567,969,00088,824,0002,113,536
9Sep 14, 2026 00:1779,138667,121,530568,189,00088,658,0002,113,536