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 listJul 21, 2026 19:49Kevin HeaveyKevin HeaveyScore: 4,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 19:494,95550,800,76839,015,0002,114,0002,121,728
2Jul 21, 2026 19:494,96850,874,15139,080,0002,156,0002,117,632
3Jul 21, 2026 19:494,96950,897,04539,119,0002,128,0002,117,632
4Jul 21, 2026 19:494,97750,957,38039,156,0002,159,0002,121,728
5Jul 21, 2026 19:494,98451,096,01739,185,0002,190,0002,121,728
6Jul 21, 2026 19:495,02751,353,78939,537,0002,188,0002,117,632
7Jul 21, 2026 19:495,03751,446,74239,603,0002,206,0002,117,632
8Jul 21, 2026 19:495,11052,005,27640,261,0002,154,0002,121,728
9Jul 21, 2026 19:495,12152,186,26940,336,0002,170,0002,117,632