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:28Josu San MartinJosu San MartinScore: 9,617Success
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:289,436103,862,34673,300,0005,020,0002,408,448
2Mar 10, 2026 18:289,55298,258,93677,273,0002,007,0002,494,464
3Mar 10, 2026 18:289,553102,791,64576,280,0003,011,0002,461,696
4Mar 10, 2026 18:289,617101,276,22472,835,0006,984,0002,453,504
5Mar 10, 2026 18:289,664100,362,58478,208,0002,005,0002,363,392
6Mar 10, 2026 18:289,666102,741,63276,217,0004,011,0002,371,584