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:32M-RochatM-RochatScore: 12,549Success
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:3212,517114,096,228101,879,0002,020,0002,113,536
2May 20, 2026 05:3212,531114,239,485101,664,0002,348,0002,113,536
3May 20, 2026 05:3212,540114,040,084101,744,0002,340,0002,113,536
4May 20, 2026 05:3212,547115,124,049101,808,0002,334,0002,113,536
5May 20, 2026 05:3212,549114,537,732101,828,0002,333,0002,113,536
6May 20, 2026 05:3212,550113,563,390101,826,0002,344,0002,113,536
7May 20, 2026 05:3212,593114,906,000102,487,0002,038,0002,113,536
8May 20, 2026 05:3212,611115,240,923102,619,0002,058,0002,113,536
9May 20, 2026 05:3212,697117,154,783103,324,0002,062,0002,113,536