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 11, 2026 19:24olliecrowolliecrowScore: 6,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:245,89774,914,64442,951,0005,993,0002,428,928
2Feb 11, 2026 19:245,91379,872,36343,069,0006,009,0002,457,600
3Feb 11, 2026 19:245,93090,780,79745,204,0004,018,0002,469,888
4Feb 11, 2026 19:246,37584,070,94446,923,0005,990,0002,482,176
5Feb 11, 2026 19:246,39981,347,77442,087,00011,023,0002,506,752
6Feb 11, 2026 19:246,53989,953,13647,235,0007,035,0002,392,064