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 listApr 28, 2026 12:55Dominique GarmierDominique GarmierScore: 7,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 12:557,27382,070,13758,358,0002,012,0002,338,816
2Apr 28, 2026 12:557,28779,751,64058,467,0002,016,0002,351,104
3Apr 28, 2026 12:557,30978,362,12657,688,0002,983,0002,347,008
4Apr 28, 2026 12:557,33576,851,24357,889,0002,994,0002,359,296
5Apr 28, 2026 12:557,36279,019,00758,101,0003,005,0002,355,200
6Apr 28, 2026 12:557,38084,821,86558,248,0003,012,0002,359,296
7Apr 28, 2026 12:557,39083,470,90359,334,0002,011,0002,351,104
8Apr 28, 2026 12:557,40383,113,43759,436,0002,014,0002,355,200
9Apr 28, 2026 12:557,45679,601,83358,891,0002,994,0002,334,720