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 10, 2026 07:38Sai PutravuSai PutravuScore: 39,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 07:3839,933341,524,717330,446,0001,003,0002,113,536
2Sep 10, 2026 07:3839,940341,571,294330,502,0001,002,0002,113,536
3Sep 10, 2026 07:3839,944341,528,900330,533,0001,003,0002,113,536
4Sep 10, 2026 07:3839,947341,625,421330,559,0001,004,0002,113,536
5Sep 10, 2026 07:3839,948341,594,882330,573,0001,002,0002,113,536
6Sep 10, 2026 07:3839,954341,628,129330,619,0001,002,0002,113,536
7Sep 10, 2026 07:3839,956341,690,955330,631,0001,004,0002,113,536
8Sep 10, 2026 07:3839,960341,819,991330,668,0001,003,0002,113,536
9Sep 10, 2026 07:3839,974341,937,263330,789,0001,002,0002,113,536