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 11, 2026 07:12wnwnScore: 3,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:133,42435,592,31028,427,00002,113,536
2May 11, 2026 07:133,43838,833,09728,539,00002,113,536
3May 11, 2026 07:133,47538,523,67928,850,00002,113,536
4May 11, 2026 07:133,48037,161,83827,869,0001,023,0002,113,536
5May 11, 2026 07:133,48437,605,28728,919,00002,113,536
6May 11, 2026 07:133,48837,110,88528,953,00002,113,536
7May 11, 2026 07:133,49238,593,43828,991,00002,113,536
8May 11, 2026 07:133,50038,829,53629,051,00002,113,536
9May 11, 2026 07:133,50937,189,89729,129,00002,113,536