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 11:31Josu San MartinJosu San MartinScore: 4,128Success
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 11:314,09448,584,08132,886,0001,101,0002,490,368
2May 10, 2026 11:314,09749,415,28132,911,0001,096,0002,482,176
3May 10, 2026 11:314,11250,703,14532,985,0001,145,0002,482,176
4May 10, 2026 11:314,12249,959,18133,171,0001,042,0002,490,368
5May 10, 2026 11:314,12847,917,68733,149,0001,117,0002,486,272
6May 10, 2026 11:314,13052,926,94333,215,0001,070,0002,486,272
7May 10, 2026 11:314,13953,676,29333,297,0001,060,0002,478,080
8May 10, 2026 11:314,14349,458,88533,219,0001,175,0002,486,272
9May 10, 2026 11:314,36150,737,10635,090,0001,109,0002,473,984