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 21, 2026 14:54Victor MerckléVictor MerckléScore: 4,616Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 14:554,58547,498,55636,990,0001,070,0002,113,536
2May 21, 2026 14:554,59148,087,94137,027,0001,085,0002,113,536
3May 21, 2026 14:554,60446,462,28737,152,0001,069,0002,113,536
4May 21, 2026 14:554,60846,085,88537,182,0001,068,0002,113,536
5May 21, 2026 14:554,61646,704,97237,227,0001,092,0002,113,536
6May 21, 2026 14:554,62147,314,41737,332,0001,030,0002,113,536
7May 21, 2026 14:554,62546,298,06737,340,0001,049,0002,113,536
8May 21, 2026 14:554,63846,390,25537,439,0001,059,0002,113,536
9May 21, 2026 14:554,65247,258,53737,537,0001,076,0002,113,536