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 listJun 25, 2026 12:38Victor MerckléVictor MerckléScore: 8,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 12:398,14075,244,51466,469,0001,098,0002,117,632stderr
2Jun 25, 2026 12:398,18275,625,71166,783,0001,131,0002,117,632stderr
3Jun 25, 2026 12:398,20275,759,47167,028,0001,056,0002,117,632stderr
4Jun 25, 2026 12:398,20775,798,64267,115,0001,005,0002,117,632stderr
5Jun 25, 2026 12:398,21775,841,87467,072,0001,132,0002,117,632stderr
6Jun 25, 2026 12:398,31076,927,53667,868,0001,109,0002,117,632stderr
7Jun 25, 2026 12:398,35076,954,62568,265,0001,041,0002,117,632stderr
8Jun 25, 2026 12:398,39277,350,29668,563,0001,096,0002,117,632stderr
9Jun 25, 2026 12:398,46377,931,30569,216,0001,031,0002,117,632stderr