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 19, 2026 07:47Victor MerckléVictor MerckléScore: 6,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 07:486,36060,551,97051,792,0001,001,0002,113,536
2May 19, 2026 07:486,36460,519,67951,787,0001,037,0002,113,536
3May 19, 2026 07:486,39262,654,86252,052,0001,003,0002,113,536
4May 19, 2026 07:486,42161,125,10252,294,0001,005,0002,113,536
5May 19, 2026 07:486,44063,018,61152,422,0001,038,0002,113,536
6May 19, 2026 07:486,46361,557,72252,606,0001,041,0002,113,536
7May 19, 2026 07:486,48161,603,36052,756,0001,041,0002,113,536
8May 19, 2026 07:486,49761,750,58152,923,0001,005,0002,113,536
9May 19, 2026 07:486,58662,533,06953,612,0001,058,0002,113,536