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 27, 2026 17:33Victor MerckléVictor MerckléScore: 7,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:347,25768,616,20159,213,0001,023,0002,113,536
2Aug 27, 2026 17:347,25768,655,16359,216,0001,021,0002,113,536
3Aug 27, 2026 17:347,38169,723,08960,200,0001,070,0002,113,536
4Aug 27, 2026 17:347,54871,764,53761,616,0001,038,0002,113,536
5Aug 27, 2026 17:347,58371,981,97461,917,0001,022,0002,113,536
6Aug 27, 2026 17:347,59071,360,94361,985,0001,015,0002,113,536
7Aug 27, 2026 17:347,59671,417,39662,028,0001,026,0002,113,536
8Aug 27, 2026 17:347,61672,329,45862,179,0001,040,0002,113,536
9Aug 27, 2026 17:347,62572,393,26462,204,0001,087,0002,113,536