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:42Daniel MastalerzDaniel MastalerzScore: 6,444Success
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:426,31480,914,68347,367,0005,039,0002,314,240
2Feb 15, 2026 18:426,32772,897,34448,478,0004,039,0002,322,432
3Feb 15, 2026 18:426,33481,469,79649,543,0003,033,0002,310,144
4Feb 15, 2026 18:426,44480,287,44950,459,0003,027,0002,310,144
5Feb 15, 2026 18:426,45175,781,33551,527,0002,020,0002,273,280
6Feb 15, 2026 18:426,48080,391,59848,802,0004,979,0002,306,048