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 listMay 10, 2026 08:11Josu San MartinJosu San MartinScore: 4,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:114,09651,656,51132,882,0001,117,0002,490,368
2May 10, 2026 08:114,10149,144,73032,886,0001,158,0002,473,984
3May 10, 2026 08:114,12151,196,38033,160,0001,051,0002,482,176
4May 10, 2026 08:114,12350,680,68433,182,0001,041,0002,473,984
5May 10, 2026 08:114,12548,938,83933,190,0001,053,0002,478,080
6May 10, 2026 08:114,13850,697,58033,230,0001,120,0002,486,272
7May 10, 2026 08:114,15548,269,24433,357,0001,132,0002,482,176
8May 10, 2026 08:114,16351,117,11433,352,0001,207,0002,473,984
9May 10, 2026 08:114,38751,095,38435,381,0001,036,0002,486,272