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 listMar 17, 2026 20:57Sergey SerebryakovSergey SerebryakovScore: 7,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 20:577,00579,920,27156,139,0002,004,0002,277,376
2Mar 17, 2026 20:577,02282,991,40257,281,0001,004,0002,445,312
3Mar 17, 2026 20:577,02983,032,11257,335,0001,005,0002,445,312
4Mar 17, 2026 20:577,03281,958,91557,362,0001,006,0002,531,328
5Mar 17, 2026 20:577,03482,475,30757,375,0001,006,0002,428,928
6Mar 17, 2026 20:577,03684,295,82957,396,0001,006,0002,445,312
7Mar 17, 2026 20:577,06592,659,00457,626,0001,010,0002,277,376
8Mar 17, 2026 20:577,19083,921,26558,664,0001,011,0002,453,504
9Mar 17, 2026 20:577,24386,673,37158,115,0002,003,0002,445,312