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 28, 2026 13:14Dominique GarmierDominique GarmierScore: 13,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 13:1513,106124,756,709105,790,0002,994,0002,351,104
2Apr 28, 2026 13:1513,115129,054,089105,859,0002,996,0002,342,912
3Apr 28, 2026 13:1513,175126,055,752107,347,0002,006,0002,347,008
4Apr 28, 2026 13:1513,188120,768,461107,478,0001,990,0002,334,720
5Apr 28, 2026 13:1513,192126,554,080107,486,0002,009,0002,351,104
6Apr 28, 2026 13:1513,260128,477,544107,059,0003,001,0002,342,912
7Apr 28, 2026 13:1513,297122,652,829108,360,0002,006,0002,342,912
8Apr 28, 2026 13:1513,307129,729,021108,446,0002,008,0002,342,912
9Apr 28, 2026 13:1513,469132,837,492108,803,0002,994,0002,347,008