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 29, 2026 06:44Karthik ReddyKarthik ReddyScore: 5,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 06:445,31754,851,81643,115,0001,020,0002,113,536
2Sep 29, 2026 06:445,33654,610,43743,279,0001,015,0002,113,536
3Sep 29, 2026 06:445,34454,758,92743,337,0001,020,0002,113,536
4Sep 29, 2026 06:445,34954,706,45243,384,0001,020,0002,113,536
5Sep 29, 2026 06:445,34954,727,63443,382,0001,020,0002,113,536
6Sep 29, 2026 06:445,35454,813,19143,428,0001,015,0002,113,536
7Sep 29, 2026 06:445,37554,973,34743,593,0001,020,0002,113,536
8Sep 29, 2026 06:445,37955,100,29043,623,0001,023,0002,113,536
9Sep 29, 2026 06:445,38555,059,23743,618,0001,082,0002,113,536