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 12:13Victor MerckléVictor MerckléScore: 5,825Success
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 12:145,79656,651,93247,043,0001,067,0002,113,536
2May 20, 2026 12:145,80957,107,61447,159,0001,058,0002,113,536
3May 20, 2026 12:145,81756,742,35847,230,0001,058,0002,113,536
4May 20, 2026 12:145,82558,395,52947,296,0001,059,0002,113,536
5May 20, 2026 12:145,82558,047,33647,324,0001,028,0002,113,536
6May 20, 2026 12:145,83458,173,07247,417,0001,011,0002,113,536
7May 20, 2026 12:145,84756,842,25547,472,0001,063,0002,113,536
8May 20, 2026 12:145,96859,346,34648,510,0001,028,0002,113,536
9May 20, 2026 12:146,06258,154,44749,299,0001,023,0002,113,536