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 21, 2026 15:08Victor MerckléVictor MerckléScore: 4,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 15:094,63146,580,18737,389,0001,056,0002,113,536
2May 21, 2026 15:094,63446,378,52137,400,0001,063,0002,113,536
3May 21, 2026 15:094,63448,509,43137,376,0001,094,0002,113,536
4May 21, 2026 15:094,63546,344,27637,391,0001,084,0002,113,536
5May 21, 2026 15:094,65748,097,79037,636,0001,025,0002,113,536
6May 21, 2026 15:094,65847,938,72137,592,0001,075,0002,113,536
7May 21, 2026 15:094,69848,601,07037,880,0001,119,0002,113,536
8May 21, 2026 15:094,86049,879,29739,299,0001,039,0002,113,536
9May 21, 2026 15:094,87549,069,67539,430,0001,038,0002,113,536