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 19, 2026 17:22Daniel MastalerzDaniel MastalerzScore: 6,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 17:225,96077,256,43242,399,0007,066,0002,433,024
2Feb 19, 2026 17:226,10478,570,04642,555,0008,105,0002,387,968
3Feb 19, 2026 17:226,12777,963,03041,878,0008,974,0002,404,352
4Feb 19, 2026 17:226,33678,656,03744,495,0008,090,0002,433,024
5Feb 19, 2026 17:226,40377,345,01447,126,0006,016,0002,355,200
6Feb 19, 2026 17:226,41080,498,72845,169,0008,030,0002,277,376