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 10:51Victor MerckléVictor MerckléScore: 5,843Success
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 10:525,67056,873,57346,047,0001,020,0002,113,536
2May 20, 2026 10:525,79657,573,19747,079,0001,031,0002,113,536
3May 20, 2026 10:525,80757,766,94347,172,0001,031,0002,113,536
4May 20, 2026 10:525,83156,280,28647,369,0001,034,0002,113,536
5May 20, 2026 10:525,84356,388,62247,469,0001,028,0002,113,536
6May 20, 2026 10:525,84656,363,49347,493,0001,035,0002,113,536
7May 20, 2026 10:525,86459,475,00047,639,0001,034,0002,113,536
8May 20, 2026 10:525,89758,748,02247,926,0001,027,0002,113,536
9May 20, 2026 10:525,94858,764,11248,337,0001,035,0002,113,536