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 16, 2026 16:52shartgepettoshartgepettoScore: 7,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 16:527,66890,761,35460,612,0003,030,0002,437,120
2Mar 16, 2026 16:527,68890,166,23260,822,0002,991,0002,375,680
3Mar 16, 2026 16:527,74485,659,11259,256,0005,021,0002,297,856
4Mar 16, 2026 16:527,76085,638,58460,383,0004,025,0002,461,696
5Mar 16, 2026 16:527,76790,774,73660,439,0004,029,0002,514,944
6Mar 16, 2026 16:527,83188,634,11261,000,0004,000,0002,347,008
7Mar 16, 2026 16:527,84192,022,62861,078,0004,005,0002,433,024
8Mar 16, 2026 16:527,88490,663,59362,417,0003,020,0002,465,792
9Mar 16, 2026 16:527,92697,971,65662,795,0002,990,0002,371,584