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 11, 2026 12:39Victor MerckléVictor MerckléScore: 3,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 12:403,85840,296,74030,915,0001,107,0002,117,632stderr
2Aug 11, 2026 12:403,88140,365,16831,111,0001,109,0002,117,632stderr
3Aug 11, 2026 12:403,89140,509,93431,190,0001,108,0002,117,632stderr
4Aug 11, 2026 12:403,89340,618,09931,148,0001,168,0002,117,632stderr
5Aug 11, 2026 12:403,89340,557,45931,154,0001,164,0002,117,632stderr
6Aug 11, 2026 12:403,92140,905,29331,428,0001,124,0002,117,632stderr
7Aug 11, 2026 12:404,05041,882,59032,494,0001,122,0002,117,632stderr
8Aug 11, 2026 12:404,06142,009,73932,604,0001,106,0002,117,632stderr
9Aug 11, 2026 12:404,08442,893,43632,792,0001,106,0002,117,632stderr