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 01:08Victor MerckléVictor MerckléScore: 4,076Success
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 01:094,06242,095,43032,676,0001,046,0002,117,632stderr
2Aug 29, 2026 01:094,06742,206,37032,751,0001,011,0002,117,632stderr
3Aug 29, 2026 01:094,07142,151,73632,762,0001,029,0002,117,632stderr
4Aug 29, 2026 01:094,07442,170,00232,795,0001,023,0002,117,632stderr
5Aug 29, 2026 01:094,07642,237,44932,714,0001,118,0002,117,632stderr
6Aug 29, 2026 01:094,07842,385,32232,831,0001,023,0002,117,632stderr
7Aug 29, 2026 01:094,08042,216,22732,849,0001,018,0002,117,632stderr
8Aug 29, 2026 01:094,15442,892,73933,469,0001,017,0002,117,632stderr
9Aug 29, 2026 01:094,22843,493,61534,073,0001,021,0002,117,632stderr