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 listJun 29, 2026 00:12Victor MerckléVictor MerckléScore: 10,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 00:1410,27192,991,03284,177,0001,078,0002,113,536
2Jun 29, 2026 00:1410,27493,041,04484,202,0001,073,0002,113,536
3Jun 29, 2026 00:1410,27493,045,90584,196,0001,086,0002,113,536
4Jun 29, 2026 00:1410,27893,026,28884,236,0001,075,0002,113,536
5Jun 29, 2026 00:1410,31793,458,06484,622,0001,014,0002,113,536
6Jun 29, 2026 00:1410,32093,408,82784,659,0001,005,0002,113,536
7Jun 29, 2026 00:1410,32293,417,48784,668,0001,012,0002,113,536
8Jun 29, 2026 00:1410,32493,459,95584,655,0001,035,0002,113,536
9Jun 29, 2026 00:1410,33393,535,02084,735,0001,035,0002,113,536