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 17:06Victor MerckléVictor MerckléScore: 34,205Success
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 17:0633,481287,004,062276,805,0001,090,0002,117,632stderr
2Aug 25, 2026 17:0634,080291,443,150281,856,0001,012,0002,117,632stderr
3Aug 25, 2026 17:0634,150291,670,280282,337,0001,116,0002,117,632stderr
4Aug 25, 2026 17:0634,181292,280,617282,687,0001,018,0002,117,632stderr
5Aug 25, 2026 17:0634,205292,065,270282,803,0001,101,0002,117,632stderr
6Aug 25, 2026 17:0634,524295,623,046285,539,0001,012,0002,117,632stderr
7Aug 25, 2026 17:0634,548295,218,621285,731,0001,022,0002,117,632stderr
8Aug 25, 2026 17:0634,621295,588,269286,302,0001,055,0002,117,632stderr
9Aug 25, 2026 17:0634,636295,938,253286,472,0001,014,0002,117,632stderr