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 5, 2026 14:17flavio87flavio87Score: 38,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:2538,961338,618,323322,372,0001,005,0002,347,008
2May 5, 2026 14:2538,967339,417,215322,430,0001,004,0002,363,392
3May 5, 2026 14:2538,970340,578,095322,452,0001,007,0002,359,296
4May 5, 2026 14:2538,971340,550,262322,461,0001,005,0002,359,296
5May 5, 2026 14:2538,979340,149,233322,526,0001,005,0002,351,104
6May 5, 2026 14:2538,984340,898,570322,567,0001,006,0002,347,008
7May 5, 2026 14:2539,005340,757,672322,740,0001,005,0002,359,296
8May 5, 2026 14:2539,155339,428,533323,984,0001,004,0002,359,296
9May 5, 2026 14:2539,377344,457,392321,787,0005,049,0002,355,200