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 19, 2026 11:24Ondřej PolaneckýOndřej PolaneckýScore: 183,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 11:25183,9061,536,209,1311,525,419,0001,004,0002,117,632stderr
2Jul 19, 2026 11:25183,9441,536,516,7161,525,734,0001,006,0002,117,632stderr
3Jul 19, 2026 11:25183,9571,536,996,3641,524,737,0002,108,0002,117,632stderr
4Jul 19, 2026 11:25183,9611,536,674,1061,525,871,0001,009,0002,117,632stderr
5Jul 19, 2026 11:25183,9891,536,777,9931,526,102,0001,007,0002,117,632stderr
6Jul 19, 2026 11:25184,0601,537,411,4081,526,695,0001,004,0002,117,632stderr
7Jul 19, 2026 11:25184,1301,537,958,0441,527,283,0001,004,0002,117,632stderr
8Jul 19, 2026 11:25184,3401,539,724,0421,529,027,0001,002,0002,117,632stderr
9Jul 19, 2026 11:25184,4491,540,618,7231,529,902,0001,031,0002,117,632stderr