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 05:18Victor MerckléVictor MerckléScore: 6,985Success
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 05:196,95865,896,52756,664,0001,089,0002,113,536
2Aug 28, 2026 05:196,96666,014,14656,631,0001,187,0002,113,536
3Aug 28, 2026 05:196,97966,365,31956,845,0001,085,0002,113,536
4Aug 28, 2026 05:196,98066,063,41256,747,0001,190,0002,113,536
5Aug 28, 2026 05:196,98566,199,45456,782,0001,201,0002,113,536
6Aug 28, 2026 05:197,01766,482,52257,089,0001,155,0002,113,536
7Aug 28, 2026 05:197,03266,618,59057,275,0001,098,0002,113,536
8Aug 28, 2026 05:197,10267,110,09257,849,0001,104,0002,113,536
9Aug 28, 2026 05:197,22068,987,43958,840,0001,090,0002,113,536