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 31, 2025 22:45PolycarbohydratePolycarbohydrateScore: 389,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2025 22:45388,4303,252,419,6973,154,012,00069,955,0002,359,296
2Jan 31, 2025 22:45389,7683,261,739,2863,170,113,00064,961,0002,363,392
3Jan 31, 2025 22:45390,6963,273,923,9063,168,806,00073,972,0002,285,568