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 01:33Victor MerckléVictor MerckléScore: 9,446Success
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 01:339,21884,810,40875,422,0001,095,0002,117,632stderr
2Aug 27, 2026 01:339,42086,487,32377,088,0001,101,0002,117,632stderr
3Aug 27, 2026 01:339,42386,508,80577,107,0001,104,0002,117,632stderr
4Aug 27, 2026 01:339,43087,387,25777,168,0001,106,0002,117,632stderr
5Aug 27, 2026 01:339,44686,713,93677,317,0001,091,0002,117,632stderr
6Aug 27, 2026 01:339,48287,010,28177,595,0001,106,0002,117,632stderr
7Aug 27, 2026 01:339,49187,106,68577,681,0001,097,0002,117,632stderr
8Aug 27, 2026 01:339,64189,043,05578,927,0001,098,0002,117,632stderr
9Aug 27, 2026 01:339,66988,604,51179,158,0001,099,0002,117,632stderr