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 20, 2026 16:46Pavel KrajcevskiPavel KrajcevskiScore: 59,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:4659,832508,281,057495,604,0001,003,0002,113,536
2May 20, 2026 16:4659,875506,439,064495,821,0001,147,0002,113,536
3May 20, 2026 16:4659,901508,767,046496,034,0001,149,0002,113,536
4May 20, 2026 16:4659,910508,910,316496,058,0001,198,0002,113,536
5May 20, 2026 16:4659,952509,717,387496,419,0001,187,0002,113,536
6May 20, 2026 16:4659,973510,812,052496,775,0001,002,0002,113,536
7May 20, 2026 16:4659,975508,288,813496,790,0001,004,0002,113,536
8May 20, 2026 16:4660,025507,870,207497,064,0001,147,0002,113,536
9May 20, 2026 16:4660,026508,819,399496,981,0001,242,0002,113,536