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 5, 2026 19:48Kevin HeaveyKevin HeaveyScore: 5,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:495,43754,730,24944,087,0001,042,0002,117,632
2Jul 5, 2026 19:495,48155,085,78844,460,0001,040,0002,117,632
3Jul 5, 2026 19:495,48555,614,14844,488,0001,042,0002,117,632
4Jul 5, 2026 19:495,50755,299,23644,675,0001,040,0002,117,632
5Jul 5, 2026 19:495,52955,505,37944,849,0001,042,0002,117,632
6Jul 5, 2026 19:495,53255,537,60143,851,0002,072,0002,117,632
7Jul 5, 2026 19:495,53656,159,31544,911,0001,041,0002,117,632
8Jul 5, 2026 19:495,53755,586,53244,942,0001,019,0002,117,632
9Jul 5, 2026 19:495,53755,527,26144,922,0001,040,0002,117,632