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 06:39Josu San MartinJosu San MartinScore: 4,166Success
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 06:394,14250,528,30733,262,0001,119,0002,486,272
2May 10, 2026 06:394,14552,447,76633,291,0001,114,0002,486,272
3May 10, 2026 06:394,15351,618,90733,342,0001,132,0002,490,368
4May 10, 2026 06:394,16251,830,02533,409,0001,142,0002,482,176
5May 10, 2026 06:394,16652,230,57833,489,0001,091,0002,482,176
6May 10, 2026 06:394,17651,765,82033,613,0001,051,0002,482,176
7May 10, 2026 06:394,19153,008,10133,713,0001,077,0002,486,272
8May 10, 2026 06:394,21650,585,35333,870,0001,127,0002,482,176
9May 10, 2026 06:394,28853,721,36234,473,0001,118,0002,478,080