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 18, 2026 16:54wnwnScore: 4,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 16:534,10357,204,65532,050,0002,003,0002,490,368
2Apr 18, 2026 16:534,12255,997,78032,202,0002,012,0002,277,376
3Apr 18, 2026 16:544,29761,628,90234,650,0001,019,0002,277,376
4Apr 18, 2026 16:534,31863,421,19034,841,000995,0002,277,376
5Apr 18, 2026 16:544,31861,406,00033,851,0001,991,0002,494,464
6Apr 18, 2026 16:544,43763,843,02234,833,0001,990,0002,277,376