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 listSep 8, 2026 17:51Victor MerckléVictor MerckléScore: 30,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 17:5529,938257,037,570247,468,0001,021,0002,117,632stderr
2Sep 8, 2026 17:5529,973258,029,393247,765,0001,015,0002,117,632stderr
3Sep 8, 2026 17:5530,006257,673,442248,044,0001,011,0002,117,632stderr
4Sep 8, 2026 17:5530,033257,844,205248,183,0001,098,0002,117,632stderr
5Sep 8, 2026 17:5530,186259,027,815249,535,0001,014,0002,117,632stderr
6Sep 8, 2026 17:5530,195259,710,088249,604,0001,021,0002,117,632stderr
7Sep 8, 2026 17:5530,227261,428,935249,880,0001,009,0002,117,632stderr
8Sep 8, 2026 17:5530,253259,759,982249,996,0001,110,0002,117,632stderr
9Sep 8, 2026 17:5530,289263,150,036250,281,0001,123,0002,117,632stderr