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 13, 2026 13:01wnwnScore: 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 13, 2026 13:013,28634,573,10127,277,00002,113,536
2May 13, 2026 13:013,28834,547,24827,297,00002,113,536
3May 13, 2026 13:013,29034,583,07527,310,00002,113,536
4May 13, 2026 13:013,29134,553,18427,322,00002,113,536
5May 13, 2026 13:013,30035,637,20427,397,00002,113,536
6May 13, 2026 13:013,30436,658,11627,429,00002,113,536
7May 13, 2026 13:013,36336,243,32026,911,0001,010,0002,113,536
8May 13, 2026 13:013,44436,915,47028,589,00002,113,536
9May 13, 2026 13:013,46638,624,22528,772,00002,113,536