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 25, 2026 19:52Maya RebholzMaya RebholzScore: 6,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 19:525,89259,344,20943,622,0005,286,0002,113,536
2May 25, 2026 19:526,02860,278,43544,537,0005,499,0002,113,536
3May 25, 2026 19:526,03160,008,92044,495,0005,567,0002,117,632
4May 25, 2026 19:526,04462,764,11144,549,0005,624,0002,113,536
5May 25, 2026 19:526,06262,945,23744,714,0005,602,0002,113,536
6May 25, 2026 19:526,08660,035,90845,075,0005,446,0002,113,536
7May 25, 2026 19:526,09060,629,16144,913,0005,635,0002,117,632
8May 25, 2026 19:526,24163,707,84346,282,0005,519,0002,113,536
9May 25, 2026 19:526,27263,299,41446,431,0005,630,0002,113,536