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 27, 2026 05:53wnwnScore: 3,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:543,40644,438,38827,268,0001,009,0002,486,272
2Apr 27, 2026 05:543,41144,022,39927,305,0001,011,0002,486,272
3Apr 27, 2026 05:543,42849,542,98527,439,0001,016,0002,482,176
4Apr 27, 2026 05:543,44948,364,55827,609,0001,022,0002,486,272
5Apr 27, 2026 05:543,45243,227,10428,655,00002,330,624
6Apr 27, 2026 05:543,46550,210,69826,783,0001,983,0002,478,080
7Apr 27, 2026 05:543,46643,998,04826,785,0001,984,0002,473,984
8Apr 27, 2026 05:543,48442,779,14526,931,0001,994,0002,486,272
9Apr 27, 2026 05:543,58543,175,66528,736,0001,026,0002,482,176