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 10:36Priyansh RathiPriyansh RathiScore: 54,238Success
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 10:3654,216475,385,976447,996,0001,999,0002,543,616
2Mar 2, 2026 10:3654,220480,239,882447,026,0003,000,0002,539,520
3Mar 2, 2026 10:3654,229479,415,066447,100,0003,000,0002,359,296
4Mar 2, 2026 10:3654,231478,715,997448,119,0002,000,0002,371,584
5Mar 2, 2026 10:3654,238478,939,417448,172,0002,000,0002,396,160
6Mar 2, 2026 10:3654,239480,766,113450,182,00002,371,584
7Mar 2, 2026 10:3654,252478,128,716450,290,00002,531,328
8Mar 2, 2026 10:3654,252481,941,075449,295,0001,000,0002,359,296
9Mar 2, 2026 10:3654,284480,689,349448,560,0001,998,0002,396,160