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 15, 2026 13:02Victor MerckléVictor MerckléScore: 6,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 13:036,96367,804,82056,792,0001,006,0002,113,536
2May 15, 2026 13:036,96666,889,83656,810,0001,016,0002,113,536
3May 15, 2026 13:036,96867,913,63856,795,0001,045,0002,113,536
4May 15, 2026 13:036,96865,132,68857,837,00002,113,536
5May 15, 2026 13:036,97065,899,53257,851,00002,113,536
6May 15, 2026 13:036,97465,253,52356,869,0001,019,0002,113,536
7May 15, 2026 13:036,98965,296,78958,015,00002,113,536
8May 15, 2026 13:037,01868,444,93557,223,0001,028,0002,113,536
9May 15, 2026 13:037,01867,739,18757,237,0001,017,0002,113,536