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 listAug 26, 2026 22:21Victor MerckléVictor MerckléScore: 4,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 22:214,31645,584,50034,684,0001,145,0002,117,632stderr
2Aug 26, 2026 22:214,31744,201,25734,721,0001,114,0002,117,632stderr
3Aug 26, 2026 22:214,33444,355,43134,866,0001,110,0002,117,632stderr
4Aug 26, 2026 22:214,33544,347,58434,852,0001,135,0002,117,632stderr
5Aug 26, 2026 22:214,35545,249,20234,858,0001,290,0002,117,632stderr
6Aug 26, 2026 22:214,41645,003,09835,472,0001,185,0002,117,632stderr
7Aug 26, 2026 22:214,42245,010,01235,618,0001,087,0002,117,632stderr
8Aug 26, 2026 22:214,49245,647,84236,237,0001,053,0002,117,632stderr
9Aug 26, 2026 22:214,55946,846,37736,764,0001,078,0002,117,632stderr