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 26, 2026 00:09olliecrowolliecrowScore: 6,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 00:106,12663,521,33946,864,0003,988,0002,310,144
2Apr 26, 2026 00:106,12763,055,87048,861,0001,994,0002,322,432
3Apr 26, 2026 00:106,12865,315,17346,877,0003,989,0002,326,528
4Apr 26, 2026 00:106,14470,313,63246,003,0005,000,0002,322,432
5Apr 26, 2026 00:106,15971,676,16848,117,0003,007,0002,514,944
6Apr 26, 2026 00:106,17866,817,44849,271,0002,011,0002,322,432
7Apr 26, 2026 00:106,19366,672,29049,390,0002,015,0002,314,240
8Apr 26, 2026 00:106,19465,846,96748,387,0003,024,0002,564,096
9Apr 26, 2026 00:106,19568,390,25749,405,0002,016,0002,514,944