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 18, 2026 09:52Aleksei ShahoikaAleksei ShahoikaScore: 12,652Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 09:5212,595116,083,60782,142,00022,403,0002,113,536
2May 18, 2026 09:5212,636116,891,64382,734,00022,152,0002,113,536
3May 18, 2026 09:5212,640116,630,61482,599,00022,314,0002,113,536
4May 18, 2026 09:5212,651115,268,24882,584,00022,427,0002,113,536
5May 18, 2026 09:5212,652116,330,48282,919,00022,093,0002,113,536
6May 18, 2026 09:5212,654115,103,91683,033,00022,002,0002,113,536
7May 18, 2026 09:5212,729116,776,05783,440,00022,215,0002,113,536
8May 18, 2026 09:5212,745115,493,13782,470,00023,317,0002,113,536
9May 18, 2026 09:5212,791116,125,62883,492,00022,681,0002,113,536