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 16, 2026 21:00Victor MerckléVictor MerckléScore: 38,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 21:1838,579330,080,586319,188,0001,020,0002,117,632stderr
2Sep 16, 2026 21:1838,600330,276,309319,237,0001,149,0002,117,632stderr
3Sep 16, 2026 21:1838,636330,519,854319,618,0001,061,0002,117,632stderr
4Sep 16, 2026 21:1838,676330,755,562319,950,0001,061,0002,117,632stderr
5Sep 16, 2026 21:1838,720331,208,685320,312,0001,067,0002,117,632stderr
6Sep 16, 2026 21:1838,838332,236,544321,286,0001,076,0002,117,632stderr
7Sep 16, 2026 21:1838,910332,845,492321,866,0001,088,0002,117,632stderr
8Sep 16, 2026 21:1838,966333,309,576322,298,0001,123,0002,117,632stderr
9Sep 16, 2026 21:1839,472337,434,488326,559,0001,063,0002,117,632stderr