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 20, 2026 17:00Daniel MastalerzDaniel MastalerzScore: 5,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 17:005,73374,078,21246,572,0001,012,0002,277,376
2Feb 20, 2026 17:015,74174,528,66245,627,0002,027,0002,281,472
3Feb 20, 2026 17:005,74373,849,17147,668,00002,277,376
4Feb 20, 2026 17:015,74574,499,21246,672,0001,014,0002,289,664
5Feb 20, 2026 17:005,85380,499,04546,557,0002,024,0002,285,568
6Feb 20, 2026 17:005,85679,106,86147,592,0001,012,0002,277,376
7Feb 20, 2026 17:005,85974,476,67847,618,0001,013,0002,347,008
8Feb 20, 2026 17:005,88275,750,11946,831,0001,992,0002,506,752
9Feb 20, 2026 17:015,89372,494,11845,915,0002,994,0002,289,664