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 26, 2026 21:02Victor MerckléVictor MerckléScore: 4,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:023,82139,895,91430,546,0001,171,0002,113,536
2Aug 26, 2026 21:023,82340,809,94830,542,0001,197,0002,113,536
3Aug 26, 2026 21:023,84841,030,92830,788,0001,152,0002,113,536
4Aug 26, 2026 21:024,02141,746,36932,318,0001,058,0002,113,536
5Aug 26, 2026 21:024,04642,616,60132,536,0001,049,0002,113,536
6Aug 26, 2026 21:024,10043,021,14132,969,0001,061,0002,113,536
7Aug 26, 2026 21:024,16643,647,08133,525,0001,053,0002,113,536
8Aug 26, 2026 21:024,19843,250,31533,818,0001,033,0002,113,536
9Aug 26, 2026 21:024,21244,002,30533,913,0001,049,0002,113,536