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 31, 2026 15:27boop34boop34Score: 14,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 15:2714,146127,241,783116,396,0001,017,0002,121,728
2Jul 31, 2026 15:2714,148127,379,464115,414,0002,019,0002,121,728
3Jul 31, 2026 15:2714,169127,531,436115,555,0002,053,0002,121,728
4Jul 31, 2026 15:2714,170127,459,375115,577,0002,038,0002,121,728
5Jul 31, 2026 15:2714,170127,600,249115,591,0002,021,0002,121,728
6Jul 31, 2026 15:2714,176127,579,684115,602,0002,067,0002,121,728
7Jul 31, 2026 15:2714,190127,817,990115,755,0002,028,0002,121,728
8Jul 31, 2026 15:2714,222128,151,706116,020,0002,029,0002,121,728
9Jul 31, 2026 15:2714,281128,561,418116,516,0002,021,0002,121,728