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 22:36Victor MerckléVictor MerckléScore: 6,964Success
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 22:366,95066,833,38857,686,00002,113,536
2May 15, 2026 22:366,95567,901,09256,712,0001,018,0002,113,536
3May 15, 2026 22:366,95767,038,71756,734,0001,013,0002,113,536
4May 15, 2026 22:366,96365,336,88056,761,0001,032,0002,113,536
5May 15, 2026 22:366,96466,984,18256,794,0001,014,0002,113,536
6May 15, 2026 22:366,97167,949,69056,860,0001,004,0002,113,536
7May 15, 2026 22:366,97667,112,83856,857,0001,046,0002,113,536
8May 15, 2026 22:366,97865,243,17256,910,0001,009,0002,113,536
9May 15, 2026 22:367,00965,983,29957,138,0001,041,0002,113,536