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 05:48M-RochatM-RochatScore: 12,490Success
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 05:4812,455113,169,193101,043,0002,337,0002,113,536
2May 20, 2026 05:4812,457114,730,177101,052,0002,344,0002,113,536
3May 20, 2026 05:4812,478112,927,113101,236,0002,337,0002,113,536
4May 20, 2026 05:4812,486113,066,822101,624,0002,014,0002,113,536
5May 20, 2026 05:4812,490113,012,107101,336,0002,335,0002,113,536
6May 20, 2026 05:4812,499114,261,692101,708,0002,038,0002,117,632
7May 20, 2026 05:4812,570113,818,678102,288,0002,044,0002,113,536
8May 20, 2026 05:4812,592128,308,669102,412,0002,109,0002,113,536
9May 20, 2026 05:4812,597114,737,139102,491,0002,065,0002,113,536