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 listAug 30, 2026 18:03Josu San MartinJosu San MartinScore: 5,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:035,81756,760,70347,145,0001,139,0002,113,536
2Aug 30, 2026 18:035,82256,706,52847,289,0001,041,0002,113,536
3Aug 30, 2026 18:035,83056,865,97547,274,0001,121,0002,113,536
4Aug 30, 2026 18:035,84156,984,95147,369,0001,119,0002,113,536
5Aug 30, 2026 18:035,87357,272,66947,634,0001,117,0002,113,536
6Aug 30, 2026 18:035,88257,316,46147,719,0001,109,0002,113,536
7Aug 30, 2026 18:035,88557,359,27447,670,0001,181,0002,113,536
8Aug 30, 2026 18:035,89457,374,91847,814,0001,112,0002,113,536
9Aug 30, 2026 18:035,94457,805,09048,226,0001,116,0002,113,536