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 listJul 7, 2026 08:32Victor MerckléVictor MerckléScore: 102,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 08:33102,045855,076,980845,975,0001,003,0002,117,632stderr
2Jul 7, 2026 08:33102,050855,146,779845,860,0001,155,0002,117,632stderr
3Jul 7, 2026 08:33102,098855,297,823846,296,0001,122,0002,117,632stderr
4Jul 7, 2026 08:33102,101855,510,591846,429,0001,012,0002,117,632stderr
5Jul 7, 2026 08:33102,116855,494,626846,561,0001,005,0002,117,632stderr
6Jul 7, 2026 08:33102,158856,083,009846,895,0001,022,0002,117,632stderr
7Jul 7, 2026 08:33102,165857,565,221846,900,0001,076,0002,117,632stderr
8Jul 7, 2026 08:33102,213856,478,185847,327,0001,044,0002,117,632stderr
9Jul 7, 2026 08:33102,249856,867,622847,590,0001,083,0002,117,632stderr