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 20:53Adam FolwarcznyAdam FolwarcznyScore: 8,363Success
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 20:538,31695,079,75853,019,00016,005,0002,322,432
2Sep 8, 2025 20:538,33690,214,74149,132,00020,053,0002,281,472
3Sep 8, 2025 20:538,35694,158,13855,282,00014,072,0002,449,408
4Sep 8, 2025 20:538,36390,320,72254,326,00015,090,0002,453,504
5Sep 8, 2025 20:538,37097,345,46952,358,00017,117,0002,494,464
6Sep 8, 2025 20:538,41392,027,10154,864,00014,963,0002,437,120