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 listJan 7, 2026 09:29Pavel SkripkinPavel SkripkinScore: 81,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 09:2981,106697,243,649439,464,000233,715,0002,293,760
2Jan 7, 2026 09:2981,216705,108,730439,406,000234,683,0002,392,064
3Jan 7, 2026 09:2981,634705,868,477440,718,000236,848,0002,273,280
4Jan 7, 2026 09:2981,783705,740,501446,866,000231,930,0002,490,368
5Jan 7, 2026 09:2981,860699,272,283440,636,000238,802,0002,318,336
6Jan 7, 2026 09:2981,874701,678,036446,708,000232,848,0002,502,656
7Jan 7, 2026 09:2982,154708,043,592445,921,000235,958,0002,494,464
8Jan 7, 2026 09:2982,327706,159,356446,553,000236,763,0002,478,080
9Jan 7, 2026 09:2982,332710,064,120447,578,000235,777,0002,347,008