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 listSep 8, 2025 21:11Adam FolwarcznyAdam FolwarcznyScore: 8,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2025 21:118,04996,698,79855,837,00010,968,0002,445,312
2Sep 8, 2025 21:118,05889,953,16552,909,00013,976,0002,396,160
3Sep 8, 2025 21:118,08089,350,11355,050,00012,011,0002,437,120
4Sep 8, 2025 21:118,17294,458,56956,853,00010,971,0002,359,296
5Sep 8, 2025 21:118,20690,621,35055,091,00013,021,0002,387,968
6Sep 8, 2025 21:118,21089,162,71358,119,00010,020,0002,396,160