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 28, 2026 20:34Victor MerckléVictor MerckléScore: 4,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 20:344,74348,396,72138,338,0001,036,0002,113,536
2Aug 28, 2026 20:344,76448,589,82338,501,0001,045,0002,113,536
3Aug 28, 2026 20:344,77248,666,94538,585,0001,028,0002,113,536
4Aug 28, 2026 20:344,77648,658,26338,600,0001,046,0002,113,536
5Aug 28, 2026 20:344,80148,834,06338,808,0001,043,0002,113,536
6Aug 28, 2026 20:344,80648,991,89138,868,0001,024,0002,113,536
7Aug 28, 2026 20:344,81548,946,71138,942,0001,024,0002,113,536
8Aug 28, 2026 20:344,82249,115,51139,001,0001,022,0002,113,536
9Aug 28, 2026 20:344,88749,646,57039,546,0001,021,0002,113,536