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 4, 2026 07:45LatentSearchLatentSearchScore: 294,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:46282,23910,237,111,794529,482,0001,813,108,0002,117,632
2Aug 4, 2026 07:46294,2789,151,640,447543,326,0001,899,183,0002,150,400
3Aug 4, 2026 07:46314,35912,362,853,982569,407,0002,039,778,0002,162,688