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 12, 2026 13:33Victor MerckléVictor MerckléScore: 5,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 13:345,13251,055,44841,529,0001,073,0002,117,632stderr
2Aug 12, 2026 13:345,17051,071,01841,853,0001,062,0002,117,632stderr
3Aug 12, 2026 13:345,17851,384,86041,921,0001,061,0002,117,632stderr
4Aug 12, 2026 13:345,17851,168,80741,894,0001,086,0002,117,632stderr
5Aug 12, 2026 13:345,18351,399,56341,971,0001,050,0002,117,632stderr
6Aug 12, 2026 13:345,18451,450,86641,979,0001,051,0002,117,632stderr
7Aug 12, 2026 13:345,24253,036,62042,499,0001,011,0002,117,632stderr
8Aug 12, 2026 13:345,28352,039,31642,781,0001,072,0002,117,632stderr
9Aug 12, 2026 13:345,32252,318,37043,173,0001,007,0002,117,632stderr