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 listDec 6, 2025 10:45Rajarshi BasuRajarshi BasuScore: 6,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 10:456,84487,418,33654,816,0001,993,0002,289,664
2Dec 6, 2025 10:456,84681,166,86054,826,0001,993,0002,527,232
3Dec 6, 2025 10:456,84792,809,77354,834,0001,993,0002,273,280
4Dec 6, 2025 10:456,99084,655,20656,013,0002,000,0002,273,280
5Dec 6, 2025 10:457,01687,802,85657,229,0001,004,0002,289,664
6Dec 6, 2025 10:457,13986,000,86257,242,0002,008,0002,289,664