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 11, 2026 20:13kuba1803kuba1803Score: 391,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 20:13391,4943,258,909,7183,180,339,00069,069,0002,113,536
2Jun 11, 2026 20:13391,5903,259,670,3833,181,128,00069,075,0002,113,536
3Jun 11, 2026 20:13391,5963,259,701,9183,180,189,00070,065,0002,113,536
4Jun 11, 2026 20:13391,7313,260,640,0383,180,294,00071,077,0002,113,536
5Jun 11, 2026 20:13391,7933,261,224,3393,180,822,00071,061,0002,113,536
6Jun 11, 2026 20:13392,2373,264,854,7743,186,504,00069,069,0002,113,536
7Jun 11, 2026 20:13393,2373,273,167,9403,193,784,00070,091,0002,113,536
8Jun 11, 2026 20:13402,0603,346,401,2473,266,033,00071,071,0002,113,536
9Jun 11, 2026 20:13402,3623,348,945,4553,269,452,00070,158,0002,113,536