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:21wnwnScore: 3,494Success
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:223,32034,817,68327,559,00002,113,536
2May 11, 2026 07:223,43136,495,43628,478,00002,113,536
3May 11, 2026 07:223,44937,860,84128,627,00002,113,536
4May 11, 2026 07:223,47839,044,71328,871,00002,113,536
5May 11, 2026 07:223,49438,629,41929,005,00002,113,536
6May 11, 2026 07:223,49436,243,56429,004,00002,113,536
7May 11, 2026 07:223,49537,939,71829,016,00002,113,536
8May 11, 2026 07:223,49938,694,79929,042,00002,113,536
9May 11, 2026 07:223,52839,399,95029,288,00002,113,536