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 listJun 19, 2026 16:08A_ShamanA_ShamanScore: 66,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:0966,226558,888,183490,435,00059,249,0002,113,536
2Jun 19, 2026 16:0966,262559,027,114491,091,00058,891,0002,113,536
3Jun 19, 2026 16:0966,276559,362,512490,330,00059,764,0002,113,536
4Jun 19, 2026 16:0966,342559,813,806490,733,00059,909,0002,113,536
5Jun 19, 2026 16:0966,358560,312,565490,349,00060,424,0002,113,536
6Jun 19, 2026 16:0966,388563,003,512490,704,00060,322,0002,113,536
7Jun 19, 2026 16:0966,505561,134,757491,768,00060,230,0002,113,536
8Jun 19, 2026 16:0966,516561,281,610490,582,00061,507,0002,113,536
9Jun 19, 2026 16:0966,586562,159,855492,164,00060,507,0002,113,536