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 19, 2026 21:52M-RochatM-RochatScore: 63,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 21:5363,390535,853,822469,363,00056,780,0002,113,536
2May 19, 2026 21:5363,394535,480,089469,399,00056,775,0002,113,536
3May 19, 2026 21:5363,415535,606,078469,480,00056,871,0002,113,536
4May 19, 2026 21:5363,422535,767,907469,634,00056,770,0002,113,536
5May 19, 2026 21:5363,433535,892,165469,416,00057,082,0002,113,536
6May 19, 2026 21:5363,435536,681,698469,201,00057,317,0002,113,536
7May 19, 2026 21:5363,477536,603,075469,325,00057,538,0002,113,536
8May 19, 2026 21:5363,499538,472,370469,543,00057,504,0002,113,536
9May 19, 2026 21:5363,631539,196,019469,224,00058,917,0002,113,536