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:02Victor MerckléVictor MerckléScore: 4,829Success
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:034,81048,064,84238,882,0001,043,0002,117,632stderr
2Aug 28, 2026 20:034,81649,018,89738,960,0001,021,0002,117,632stderr
3Aug 28, 2026 20:034,82148,514,45138,991,0001,028,0002,117,632stderr
4Aug 28, 2026 20:034,82549,117,67339,033,0001,021,0002,117,632stderr
5Aug 28, 2026 20:034,82948,463,97639,062,0001,022,0002,117,632stderr
6Aug 28, 2026 20:034,84448,359,44239,167,0001,039,0002,117,632stderr
7Aug 28, 2026 20:034,84449,262,36939,183,0001,030,0002,117,632stderr
8Aug 28, 2026 20:034,93750,048,54939,953,0001,025,0002,117,632stderr
9Aug 28, 2026 20:034,94650,128,19440,039,0001,021,0002,117,632stderr