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 listApr 26, 2026 14:58wnwnScore: 3,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:593,39949,721,36427,211,0001,007,0002,473,984
2Apr 26, 2026 14:593,43045,992,51228,475,00002,490,368
3Apr 26, 2026 14:593,44241,546,33427,550,0001,020,0002,482,176
4Apr 26, 2026 14:593,44744,340,81527,590,0001,021,0002,490,368
5Apr 26, 2026 14:593,45642,443,14427,667,0001,024,0002,490,368
6Apr 26, 2026 14:593,46746,935,52627,753,0001,027,0002,490,368
7Apr 26, 2026 14:593,47342,489,58026,842,0001,988,0002,330,624
8Apr 26, 2026 14:593,56045,086,38728,532,0001,019,0002,490,368
9Apr 26, 2026 14:593,57048,754,23328,617,0001,022,0002,486,272