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 21, 2026 22:52BenBenScore: 25,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 22:5325,010221,682,176206,586,0001,002,0002,383,872
2Apr 21, 2026 22:5325,040225,890,406205,842,0001,998,0002,322,432
3Apr 21, 2026 22:5325,070224,712,057206,085,0002,000,0002,326,528
4Apr 21, 2026 22:5325,086225,088,658205,219,0003,003,0002,392,064
5Apr 21, 2026 22:5325,100226,782,092206,341,0001,993,0002,392,064
6Apr 21, 2026 22:5325,119220,920,459205,503,0002,992,0002,453,504
7Apr 21, 2026 22:5325,136226,921,972207,628,0001,003,0002,326,528
8Apr 21, 2026 22:5325,188228,950,391207,064,0002,000,0002,387,968
9Apr 21, 2026 22:5325,469228,548,736210,396,0001,001,0002,383,872