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 7, 2026 15:00Daniel MastalerzDaniel MastalerzScore: 14,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 15:0014,185143,484,278116,739,000997,0002,273,280
2Feb 7, 2026 15:0014,188148,814,358112,773,0004,989,0002,273,280
3Feb 7, 2026 15:0014,196144,174,070116,829,000998,0002,383,872
4Feb 7, 2026 15:0014,221137,432,191116,033,0002,000,0002,269,184
5Feb 7, 2026 15:0014,261149,242,438117,361,0001,003,0002,269,184
6Feb 7, 2026 15:0014,271140,516,419118,450,00002,277,376
7Feb 7, 2026 15:0014,286146,039,860115,560,0003,014,0002,273,280
8Feb 7, 2026 15:0014,289143,947,260116,591,0002,010,0002,383,872
9Feb 7, 2026 15:0014,304150,692,848117,726,000997,0002,400,256