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 22, 2026 09:33wnwnScore: 4,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 09:334,61456,568,58337,292,0001,007,0002,330,624
2Apr 22, 2026 09:334,62654,254,63637,392,0001,010,0002,486,272
3Apr 22, 2026 09:334,62855,714,48237,409,0001,011,0002,330,624
4Apr 22, 2026 09:334,63056,163,87537,423,0001,011,0002,486,272
5Apr 22, 2026 09:334,65253,441,09337,602,0001,016,0002,490,368
6Apr 22, 2026 09:334,67852,172,76236,839,0001,991,0002,490,368
7Apr 22, 2026 09:334,72255,376,53938,191,0001,005,0002,482,176
8Apr 22, 2026 09:334,79057,217,40337,770,0001,987,0002,478,080
9Apr 22, 2026 09:334,80856,493,34637,914,0001,995,0002,486,272