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 listAug 31, 2026 02:19Josu San MartinJosu San MartinScore: 5,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 02:265,39953,220,47643,776,0001,039,0002,113,536
2Aug 31, 2026 02:265,40053,297,88643,799,0001,022,0002,113,536
3Aug 31, 2026 02:265,40353,267,35443,814,0001,034,0002,113,536
4Aug 31, 2026 02:265,40553,275,27843,827,0001,040,0002,113,536
5Aug 31, 2026 02:265,40753,297,95543,839,0001,040,0002,113,536
6Aug 31, 2026 02:265,40853,246,88143,830,0001,064,0002,113,536
7Aug 31, 2026 02:265,41753,351,10143,930,0001,033,0002,113,536
8Aug 31, 2026 02:265,42553,490,89743,920,0001,109,0002,113,536
9Aug 31, 2026 02:265,43353,513,59643,977,0001,120,0002,113,536