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 26, 2026 21:22Victor MerckléVictor MerckléScore: 3,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:233,75039,499,11029,970,0001,156,0002,117,632stderr
2Aug 26, 2026 21:233,78339,789,08930,320,0001,087,0002,117,632stderr
3Aug 26, 2026 21:233,78539,875,01630,255,0001,164,0002,117,632stderr
4Aug 26, 2026 21:233,78839,843,80530,368,0001,079,0002,117,632stderr
5Aug 26, 2026 21:233,81140,007,57330,541,0001,093,0002,117,632stderr
6Aug 26, 2026 21:233,81139,977,61330,568,0001,069,0002,117,632stderr
7Aug 26, 2026 21:233,85740,437,81730,836,0001,181,0002,117,632stderr
8Aug 26, 2026 21:233,89340,698,27831,186,0001,128,0002,117,632stderr
9Aug 26, 2026 21:234,02342,442,00132,313,0001,078,0002,117,632stderr