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 13:31Victor MerckléVictor MerckléScore: 4,721Success
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 13:324,70247,200,85837,948,0001,080,0002,113,536
2May 21, 2026 13:324,70848,770,10938,011,0001,072,0002,113,536
3May 21, 2026 13:324,71549,055,25937,987,0001,152,0002,113,536
4May 21, 2026 13:324,71947,026,76238,118,0001,055,0002,113,536
5May 21, 2026 13:324,72148,608,52838,176,0001,010,0002,113,536
6May 21, 2026 13:324,72947,968,36838,225,0001,027,0002,113,536
7May 21, 2026 13:324,74248,251,43238,299,0001,062,0002,113,536
8May 21, 2026 13:324,74347,262,19838,371,0001,003,0002,113,536
9May 21, 2026 13:324,78447,732,94938,671,0001,041,0002,113,536