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 06:48wnwnScore: 3,300Success
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 06:483,28037,531,87327,226,00002,113,536
2May 11, 2026 06:483,28336,607,97927,253,00002,113,536
3May 11, 2026 06:483,29335,305,74327,332,00002,113,536
4May 11, 2026 06:483,29534,594,27427,355,00002,113,536
5May 11, 2026 06:483,30034,814,80727,397,00002,113,536
6May 11, 2026 06:483,30237,617,82627,407,00002,113,536
7May 11, 2026 06:483,42935,800,14228,468,00002,113,536
8May 11, 2026 06:483,44939,092,25828,633,00002,113,536
9May 11, 2026 06:483,46638,881,19928,768,00002,113,536