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 4, 2026 15:25juniskewljuniskewlScore: 60,693Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 15:2560,669534,075,408502,552,000999,0002,281,472
2Mar 4, 2026 15:2560,674532,097,804501,596,0001,998,0002,281,472
3Mar 4, 2026 15:2560,682529,445,748501,663,0001,998,0002,269,184
4Mar 4, 2026 15:2560,688529,448,195501,711,0001,998,0002,265,088
5Mar 4, 2026 15:2560,693525,173,274501,753,0001,999,0002,285,568
6Mar 4, 2026 15:2560,697527,852,764501,787,0001,999,0002,273,280
7Mar 4, 2026 15:2560,746527,637,911502,190,0002,000,0002,285,568
8Mar 4, 2026 15:2560,756532,722,497503,271,0001,000,0002,285,568
9Mar 4, 2026 15:2560,759534,053,298503,297,0001,000,0002,281,472