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 00:54Mikołaj UzarskiMikołaj UzarskiScore: 5,613Success
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 00:565,51776,449,00041,813,0003,982,0002,449,408
2Feb 20, 2026 00:545,52072,163,80241,835,0003,984,0002,400,256
3Feb 20, 2026 00:565,57066,101,07039,198,0007,035,0002,465,792
4Feb 20, 2026 00:545,61373,742,95040,510,0006,076,0002,281,472
5Feb 20, 2026 00:565,61373,614,21841,523,0005,063,0002,351,104
6Feb 20, 2026 00:545,65270,256,68138,927,0007,985,0002,453,504