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 12:29HamzaHamzaScore: 31,693Success
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 12:2931,185269,298,864257,832,0001,006,0002,113,536
2May 17, 2026 12:2931,505272,312,539260,386,0001,112,0002,113,536
3May 17, 2026 12:2931,554271,150,002260,746,0001,158,0002,113,536
4May 17, 2026 12:2931,689274,642,290261,911,0001,114,0002,113,536
5May 17, 2026 12:2931,693272,003,929261,927,0001,133,0002,113,536
6May 17, 2026 12:2931,696273,631,735261,950,0001,132,0002,113,536
7May 17, 2026 12:2931,707271,984,903262,156,0001,020,0002,113,536
8May 17, 2026 12:2931,718273,365,285262,147,0001,119,0002,113,536
9May 17, 2026 12:2931,732274,968,118262,247,0001,132,0002,113,536