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 25, 2026 12:46Victor MerckléVictor MerckléScore: 4,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 12:474,23743,512,52034,156,0001,015,0002,117,632stderr
2Aug 25, 2026 12:474,24543,641,66434,211,0001,023,0002,117,632stderr
3Aug 25, 2026 12:474,24744,190,73734,161,0001,092,0002,117,632stderr
4Aug 25, 2026 12:474,25043,618,43734,202,0001,075,0002,117,632stderr
5Aug 25, 2026 12:474,28143,919,78534,525,0001,011,0002,117,632stderr
6Aug 25, 2026 12:474,28644,034,78134,471,0001,106,0002,117,632stderr
7Aug 25, 2026 12:474,30944,200,47734,712,0001,058,0002,117,632stderr
8Aug 25, 2026 12:474,31544,219,61234,790,0001,027,0002,117,632stderr
9Aug 25, 2026 12:474,31544,216,87334,670,0001,152,0002,117,632stderr