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 listJul 3, 2026 17:40Josu San MartinJosu San MartinScore: 12,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:4012,589113,898,334103,478,0001,015,0002,113,536
2Jul 3, 2026 17:4012,667114,512,770104,133,0001,008,0002,113,536
3Jul 3, 2026 17:4012,680114,623,605104,233,0001,015,0002,113,536
4Jul 3, 2026 17:4012,762115,317,118104,911,0001,017,0002,113,536
5Jul 3, 2026 17:4012,779115,787,059105,062,0001,009,0002,113,536
6Jul 3, 2026 17:4012,798116,931,658105,218,0001,009,0002,113,536
7Jul 3, 2026 17:4012,820115,797,632105,405,0001,008,0002,113,536
8Jul 3, 2026 17:4012,905116,480,560106,098,0001,016,0002,113,536
9Jul 3, 2026 17:4013,678122,884,904112,513,0001,016,0002,113,536