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 listApr 30, 2026 00:34olliecrowolliecrowScore: 8,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 00:368,51886,972,58867,676,0003,030,0002,400,256
2Apr 30, 2026 00:368,57279,510,86668,144,0003,006,0002,560,000
3Apr 30, 2026 00:368,57579,549,61669,143,0002,033,0002,531,328
4Apr 30, 2026 00:368,59379,529,74069,314,0002,009,0002,437,120
5Apr 30, 2026 00:368,60479,628,09767,394,0004,023,0002,478,080
6Apr 30, 2026 00:368,65680,246,17166,857,0004,989,0002,469,888
7Apr 30, 2026 00:368,67980,510,82771,022,0001,014,0002,543,616
8Apr 30, 2026 00:368,68793,396,96269,105,0003,004,0002,347,008
9Apr 30, 2026 00:368,77781,056,35667,862,0004,989,0002,490,368