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 2, 2026 16:58Priyansh RathiPriyansh RathiScore: 41,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 16:5841,517372,969,600341,588,0003,005,0002,547,712
2Mar 2, 2026 16:5841,519370,939,871342,612,0001,997,0002,535,424
3Mar 2, 2026 16:5841,533372,262,342341,728,0002,997,0002,371,584
4Mar 2, 2026 16:5841,549375,855,388343,858,000999,0002,371,584
5Mar 2, 2026 16:5841,584374,452,863345,150,00002,371,584
6Mar 2, 2026 16:5841,613376,691,200345,386,00002,359,296
7Mar 2, 2026 16:5841,639375,355,286343,606,0001,997,0002,359,296
8Mar 2, 2026 16:5841,677374,405,659343,921,0001,999,0002,359,296
9Mar 2, 2026 16:5841,778374,580,390343,759,0002,997,0002,535,424