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 15:15Rajarshi BasuRajarshi BasuScore: 6,348Success
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 15:156,20479,051,70651,493,00002,289,664
2Dec 6, 2025 15:156,20576,047,99650,495,0001,009,0002,289,664
3Dec 6, 2025 15:156,25277,393,93549,896,0001,995,0002,289,664
4Dec 6, 2025 15:156,34882,267,04651,677,0001,013,0002,289,664
5Dec 6, 2025 15:156,36479,155,79050,830,0001,993,0002,289,664
6Dec 6, 2025 15:156,36776,750,04250,853,0001,994,0002,269,184