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 listFeb 17, 2026 20:56wnwnScore: 7,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 20:566,34182,880,74050,606,0002,024,0002,260,992
2Feb 17, 2026 20:566,36278,565,21449,817,0002,989,0002,355,200
3Feb 17, 2026 20:566,49475,681,24150,910,0002,994,0002,473,984
4Feb 17, 2026 20:567,18986,170,90355,690,0003,977,0002,441,216
5Feb 17, 2026 20:567,32385,035,86257,796,0002,989,0002,285,568
6Feb 17, 2026 20:567,33987,541,75056,919,0003,994,0002,441,216