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 04:46Victor MerckléVictor MerckléScore: 6,971Success
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 04:466,96366,904,89056,793,0001,001,0002,113,536
2May 15, 2026 04:466,96865,613,81357,836,00002,113,536
3May 15, 2026 04:466,96968,173,58256,804,0001,044,0002,113,536
4May 15, 2026 04:466,97065,121,17657,854,00002,113,536
5May 15, 2026 04:466,97168,022,25056,861,0001,002,0002,113,536
6May 15, 2026 04:466,97566,379,27356,896,0001,003,0002,113,536
7May 15, 2026 04:466,97665,298,21656,896,0001,009,0002,113,536
8May 15, 2026 04:466,97865,684,44457,922,00002,113,536
9May 15, 2026 04:467,02065,975,73758,274,00002,113,536