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 25, 2026 16:21Victor MerckléVictor MerckléScore: 54,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 16:2154,139457,786,026448,332,0001,027,0002,117,632stderr
2Aug 25, 2026 16:2154,144458,462,238448,291,0001,107,0002,117,632stderr
3Aug 25, 2026 16:2154,155458,005,056448,401,0001,093,0002,117,632stderr
4Aug 25, 2026 16:2154,163457,963,171448,456,0001,104,0002,117,632stderr
5Aug 25, 2026 16:2154,278459,012,100449,437,0001,076,0002,117,632stderr
6Aug 25, 2026 16:2154,297459,778,579449,668,0001,001,0002,117,632stderr
7Aug 25, 2026 16:2154,326459,969,778449,743,0001,166,0002,117,632stderr
8Aug 25, 2026 16:2154,722462,952,594453,163,0001,031,0002,117,632stderr
9Aug 25, 2026 16:2154,974464,632,627455,194,0001,093,0002,117,632stderr