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:55M-RochatM-RochatScore: 11,814Success
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:5511,792110,291,59195,547,0002,331,0002,113,536
2May 20, 2026 05:5511,795107,671,36895,589,0002,317,0002,113,536
3May 20, 2026 05:5511,803107,960,66095,627,0002,344,0002,113,536
4May 20, 2026 05:5511,812108,655,44495,707,0002,333,0002,113,536
5May 20, 2026 05:5511,814109,401,00095,715,0002,347,0002,113,536
6May 20, 2026 05:5511,825108,969,86095,797,0002,357,0002,113,536
7May 20, 2026 05:5511,826108,079,98896,118,0002,038,0002,113,536
8May 20, 2026 05:5511,900110,134,09096,695,0002,076,0002,113,536
9May 20, 2026 05:5511,913111,427,01296,849,0002,030,0002,113,536