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 listAug 29, 2026 09:13Victor MerckléVictor MerckléScore: 4,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 09:144,90449,022,59839,607,0001,102,0002,117,632stderr
2Aug 29, 2026 09:144,90749,755,69939,638,0001,094,0002,117,632stderr
3Aug 29, 2026 09:144,91148,999,52939,676,0001,088,0002,117,632stderr
4Aug 29, 2026 09:144,91148,925,82239,642,0001,121,0002,117,632stderr
5Aug 29, 2026 09:144,91448,955,47139,775,0001,018,0002,117,632stderr
6Aug 29, 2026 09:144,91448,950,50239,675,0001,114,0002,117,632stderr
7Aug 29, 2026 09:144,92448,993,73239,775,0001,097,0002,117,632stderr
8Aug 29, 2026 09:145,06350,174,50040,979,0001,048,0002,117,632stderr
9Aug 29, 2026 09:145,13450,773,54541,608,0001,011,0002,117,632stderr