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 10:01wnwnScore: 3,493Success
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 10:023,44142,142,50127,541,0001,020,0002,326,528
2Apr 22, 2026 10:023,45447,928,11427,646,0001,023,0002,383,872
3Apr 22, 2026 10:023,48450,200,33226,926,0001,994,0002,387,968
4Apr 22, 2026 10:023,49145,525,83926,979,0001,998,0002,392,064
5Apr 22, 2026 10:023,49349,161,80326,995,0001,999,0002,326,528
6Apr 22, 2026 10:023,49448,584,14227,008,0002,000,0002,387,968
7Apr 22, 2026 10:023,56045,654,85028,530,0001,018,0002,375,680
8Apr 22, 2026 10:023,57545,431,95728,655,0001,023,0002,383,872
9Apr 22, 2026 10:023,62147,470,50728,055,0002,003,0002,375,680