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 05:58Victor MerckléVictor MerckléScore: 4,189Success
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 05:584,15143,497,76133,306,0001,152,0002,117,632stderr
2Aug 28, 2026 05:584,15742,899,19333,354,0001,155,0002,117,632stderr
3Aug 28, 2026 05:584,17442,926,14733,539,0001,107,0002,117,632stderr
4Aug 28, 2026 05:584,18343,623,49433,562,0001,158,0002,117,632stderr
5Aug 28, 2026 05:584,18943,787,37633,726,0001,046,0002,117,632stderr
6Aug 28, 2026 05:584,30653,705,04734,522,0001,219,0002,117,632stderr
7Aug 28, 2026 05:584,33853,246,06134,825,0001,181,0002,117,632stderr
8Aug 28, 2026 05:584,37044,554,65135,175,0001,096,0002,117,632stderr
9Aug 28, 2026 05:584,56554,856,95136,748,0001,142,0002,117,632stderr