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 19:49Daniel MastalerzDaniel MastalerzScore: 6,058Success
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 19:496,04180,092,65746,130,0004,011,0002,306,048
2Feb 19, 2026 19:496,04378,518,32846,143,0004,012,0002,310,144
3Feb 19, 2026 19:496,04577,410,70446,160,0004,013,0002,322,432
4Feb 19, 2026 19:496,05074,898,85147,204,0003,013,0002,322,432
5Feb 19, 2026 19:496,05574,275,30246,239,0004,020,0002,523,136
6Feb 19, 2026 19:496,05773,441,15147,258,0003,016,0002,277,376
7Feb 19, 2026 19:496,05877,445,23346,256,0004,022,0002,322,432
8Feb 19, 2026 19:496,08276,943,04747,515,0002,969,0002,265,088
9Feb 19, 2026 19:496,15375,086,02247,063,0004,005,0002,318,336
10Feb 19, 2026 19:496,16078,291,11347,121,0004,010,0002,318,336
11Feb 19, 2026 19:496,16677,266,86148,171,0003,010,0002,310,144
12Feb 19, 2026 19:496,19579,814,68149,401,0002,016,0002,269,184