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 13:56Victor MerckléVictor MerckléScore: 3,984Success
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 13:573,91340,877,92931,341,0001,144,0002,113,536
2Aug 27, 2026 13:573,91640,857,60231,361,0001,148,0002,113,536
3Aug 27, 2026 13:573,94541,222,02831,602,0001,147,0002,113,536
4Aug 27, 2026 13:573,94941,188,61231,644,0001,139,0002,113,536
5Aug 27, 2026 13:573,98441,442,90931,987,0001,081,0002,113,536
6Aug 27, 2026 13:574,00141,625,75832,086,0001,124,0002,113,536
7Aug 27, 2026 13:574,07251,107,05432,642,0001,157,0002,113,536
8Aug 27, 2026 13:574,25143,739,27434,224,0001,067,0002,113,536
9Aug 27, 2026 13:574,27544,611,18634,254,0001,231,0002,113,536