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 listFeb 5, 2026 04:46Josu San MartinJosu San MartinScore: 6,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:465,88174,506,32947,815,000996,0002,281,472
2Feb 5, 2026 04:465,96068,784,38948,458,0001,009,0002,428,928
3Feb 5, 2026 04:466,00273,974,89346,828,0002,989,0002,281,472
4Feb 5, 2026 04:466,07473,975,96349,405,0001,008,0002,441,216
5Feb 5, 2026 04:466,08075,616,06549,454,0001,009,0002,285,568
6Feb 5, 2026 04:466,12473,725,04448,839,0001,993,0002,285,568