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 listJan 11, 2026 22:25Sevas666Sevas666Score: 385,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 22:25383,1983,202,394,9303,062,632,000117,908,0002,355,200
2Jan 11, 2026 22:25383,3383,209,678,6253,055,834,000125,869,0002,355,200
3Jan 11, 2026 22:25383,7373,210,755,2643,087,108,00097,908,0002,351,104
4Jan 11, 2026 22:25384,8373,224,756,4333,080,250,000113,898,0002,355,200
5Jan 11, 2026 22:25385,1063,230,539,2313,079,477,000116,904,0002,355,200
6Jan 11, 2026 22:25385,1733,230,146,5373,080,045,000116,887,0002,408,448
7Jan 11, 2026 22:25385,2233,231,297,2583,088,479,000108,875,0002,355,200
8Jan 11, 2026 22:25385,3643,224,428,3683,084,612,000113,911,0002,355,200
9Jan 11, 2026 22:25385,3843,230,478,1313,086,801,000111,884,0002,355,200