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 21, 2026 14:27Daniel MastalerzDaniel MastalerzScore: 5,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 14:275,55872,065,66242,118,0004,011,0002,326,528
2Feb 21, 2026 14:275,57773,021,67042,264,0004,025,0002,285,568
3Feb 21, 2026 14:275,59071,134,87542,363,0004,034,0002,269,184
4Feb 21, 2026 14:275,61972,001,47343,599,0003,041,0002,523,136
5Feb 21, 2026 14:275,64274,519,18242,843,0003,985,0002,318,336
6Feb 21, 2026 14:275,66069,895,77542,981,0003,998,0002,318,336
7Feb 21, 2026 14:275,66770,154,46744,034,0003,002,0002,265,088
8Feb 21, 2026 14:275,68672,255,42143,175,0004,016,0002,326,528
9Feb 21, 2026 14:275,68969,116,94943,199,0004,018,0002,310,144
10Feb 21, 2026 14:275,69776,245,27844,265,0003,018,0002,265,088
11Feb 21, 2026 14:275,76175,890,89243,829,0003,984,0002,273,280
12Feb 21, 2026 14:275,76774,788,28643,879,0003,989,0002,265,088