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 31, 2026 00:15olliecrowolliecrowScore: 9,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 00:158,16495,678,08467,762,00002,310,144
2Jan 31, 2026 00:158,17294,895,62764,833,0002,992,0002,297,856
3Jan 31, 2026 00:158,29396,803,35367,834,000997,0002,428,928
4Jan 31, 2026 00:159,650104,272,51174,092,0006,007,0002,502,656
5Jan 31, 2026 00:159,728105,111,46176,756,0003,987,0002,371,584
6Jan 31, 2026 00:159,824108,188,43175,500,0006,040,0002,428,928