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 16, 2026 04:03Victor MerckléVictor MerckléScore: 7,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 04:036,95065,857,49656,658,0001,032,0002,113,536
2May 16, 2026 04:036,95365,956,76156,690,0001,021,0002,113,536
3May 16, 2026 04:036,95665,102,36456,735,0001,001,0002,113,536
4May 16, 2026 04:036,95666,932,28256,710,0001,027,0002,113,536
5May 16, 2026 04:037,00565,482,05057,139,0001,005,0002,113,536
6May 16, 2026 04:037,04367,990,45257,385,0001,077,0002,113,536
7May 16, 2026 04:037,07065,880,71058,688,00002,113,536
8May 16, 2026 04:037,09867,042,86157,894,0001,023,0002,113,536
9May 16, 2026 04:037,11266,965,84558,023,0001,010,0002,113,536