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 listFeb 15, 2026 18:41Daniel MastalerzDaniel MastalerzScore: 13,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:4113,457142,495,262107,705,0003,989,0002,273,280
2Feb 15, 2026 18:4113,577140,876,343110,693,0001,994,0002,523,136
3Feb 15, 2026 18:4113,591138,001,912108,813,0003,993,0002,265,088