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 17, 2026 09:51Joel ChongJoel ChongScore: 50,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 09:5150,074444,427,802413,617,0001,998,0002,285,568
2Mar 17, 2026 09:5150,158442,637,472415,311,0001,000,0002,277,376
3Mar 17, 2026 09:5150,182438,687,812414,512,0001,997,0002,269,184
4Mar 17, 2026 09:5150,182442,505,588415,511,0001,001,0002,285,568
5Mar 17, 2026 09:5150,187440,416,923414,556,0001,997,0002,519,040
6Mar 17, 2026 09:5150,197444,454,876414,634,0001,998,0002,523,136
7Mar 17, 2026 09:5150,222439,018,146414,842,0001,999,0002,285,568
8Mar 17, 2026 09:5150,318440,342,291415,642,0001,998,0002,285,568
9Mar 17, 2026 09:5150,345448,475,083415,868,0001,999,0002,260,992