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 listMar 10, 2026 18:19Josu San MartinJosu San MartinScore: 7,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 18:196,44871,429,66051,498,0002,019,0002,482,176
2Mar 10, 2026 18:196,64777,518,88352,161,0003,009,0002,412,544
3Mar 10, 2026 18:196,87280,412,10854,038,0003,002,0002,338,816
4Mar 10, 2026 18:197,24380,986,51656,109,0004,007,0002,289,664
5Mar 10, 2026 18:197,30788,147,76958,624,0002,021,0002,359,296
6Mar 10, 2026 18:197,49283,430,55958,175,0004,012,0002,306,048