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 14, 2026 04:06Victor MerckléVictor MerckléScore: 7,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 04:067,03567,850,52058,394,00002,113,536
2May 14, 2026 04:067,03566,137,62558,396,00002,113,536
3May 14, 2026 04:067,03766,544,10058,411,00002,113,536
4May 14, 2026 04:067,03967,182,92557,423,0001,008,0002,113,536
5May 14, 2026 04:067,04066,618,98657,404,0001,032,0002,113,536
6May 14, 2026 04:067,04165,766,34258,441,00002,113,536
7May 14, 2026 04:067,04567,596,54557,459,0001,022,0002,113,536
8May 14, 2026 04:067,09368,712,51258,872,00002,113,536
9May 14, 2026 04:067,09868,090,02757,903,0001,014,0002,113,536