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 15:17wnwnScore: 3,462Success
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 15:183,43042,481,21927,455,0001,016,0002,494,464
2Apr 26, 2026 15:183,43140,403,35628,481,00002,494,464
3Apr 26, 2026 15:183,44246,052,40227,555,0001,020,0002,482,176
4Apr 26, 2026 15:183,44745,745,96327,593,0001,021,0002,494,464
5Apr 26, 2026 15:183,46245,804,40228,737,00002,490,368
6Apr 26, 2026 15:183,46744,955,57326,798,0001,985,0002,482,176
7Apr 26, 2026 15:183,48444,694,70326,926,0001,994,0002,486,272
8Apr 26, 2026 15:183,51545,681,84828,170,0001,006,0002,473,984
9Apr 26, 2026 15:183,54844,561,58428,436,0001,015,0002,486,272