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 listMar 15, 2026 19:19Ondřej PolaneckýOndřej PolaneckýScore: 44,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 19:1944,057389,793,650154,862,000210,812,0002,322,432
2Mar 15, 2026 19:1844,156395,665,907153,789,000212,709,0002,322,432
3Mar 15, 2026 19:1844,246398,158,663154,681,000212,562,0002,428,928
4Mar 15, 2026 19:1944,269393,152,280155,760,000211,674,0002,334,720
5Mar 15, 2026 19:1844,490398,961,761154,691,000214,572,0002,478,080
6Mar 15, 2026 19:1944,899396,069,607154,859,000217,801,0002,478,080