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 17, 2026 01:58M-RochatM-RochatScore: 12,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5912,620114,077,307102,566,0002,185,0002,113,536
2May 17, 2026 01:5912,621114,001,531102,548,0002,208,0002,113,536
3May 17, 2026 01:5912,633113,668,527102,654,0002,207,0002,113,536
4May 17, 2026 01:5912,644115,549,736102,734,0002,219,0002,113,536
5May 17, 2026 01:5912,654114,790,952101,773,0003,263,0002,113,536
6May 17, 2026 01:5912,662115,351,031102,895,0002,204,0002,113,536
7May 17, 2026 01:5912,669113,952,046102,927,0002,226,0002,113,536
8May 17, 2026 01:5912,688115,092,257103,099,0002,215,0002,113,536
9May 17, 2026 01:5912,693114,164,167103,179,0002,180,0002,113,536