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 14:56Daniel MastalerzDaniel MastalerzScore: 15,963Success
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 14:5615,891159,087,396128,896,0002,997,0002,273,280
2Feb 7, 2026 14:5615,906154,508,392130,022,0002,000,0002,277,376
3Feb 7, 2026 14:5615,937161,247,608132,276,00002,396,160
4Feb 7, 2026 14:5615,948152,569,756131,366,0001,002,0002,498,560
5Feb 7, 2026 14:5615,963167,551,072131,492,0001,003,0002,273,280
6Feb 7, 2026 14:5615,969156,991,959131,537,0001,004,0002,392,064
7Feb 7, 2026 14:5615,969163,659,562131,542,0001,004,0002,396,160
8Feb 7, 2026 14:5615,982164,776,810126,668,0005,984,0002,379,776
9Feb 7, 2026 14:5615,995169,007,275129,762,0002,994,0002,400,256