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 11:25Priyansh RathiPriyansh RathiScore: 46,223Success
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 11:2546,154408,920,270381,079,0002,000,0002,396,160
2Mar 2, 2026 11:2546,191414,482,893381,391,0001,996,0002,371,584
3Mar 2, 2026 11:2546,192410,785,120379,389,0004,004,0002,387,968
4Mar 2, 2026 11:2546,193409,159,413382,404,0001,001,0002,387,968
5Mar 2, 2026 11:2546,223408,686,340381,655,0001,998,0002,355,200
6Mar 2, 2026 11:2546,261412,473,697381,966,0001,999,0002,535,424
7Mar 2, 2026 11:2546,263410,402,755379,988,0003,999,0002,535,424
8Mar 2, 2026 11:2546,271410,274,787382,049,0002,000,0002,359,296
9Mar 2, 2026 11:2546,285410,537,750382,164,0002,000,0002,539,520