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 18:30olliecrowolliecrowScore: 6,282Success
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 18:305,93374,176,72047,236,0002,010,0002,469,888
2Feb 11, 2026 18:306,00482,965,80847,840,0001,993,0002,396,160
3Feb 11, 2026 18:306,06476,064,69846,306,0004,026,0002,433,024
4Feb 11, 2026 18:306,28278,329,79348,133,0004,011,0002,486,272
5Feb 11, 2026 18:306,29082,183,20249,193,0003,011,0002,273,280
6Feb 11, 2026 18:306,34377,072,70349,606,0003,037,0002,355,200