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 18, 2026 02:09Adam LaRussoAdam LaRussoScore: 56,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 02:0956,972499,497,721470,865,0001,999,0002,281,472
2Feb 18, 2026 02:0956,976501,347,320470,903,0001,999,0002,281,472
3Feb 18, 2026 02:0956,979496,183,437469,923,0002,999,0002,281,472
4Feb 18, 2026 02:0956,980496,036,455470,939,0001,999,0002,269,184
5Feb 18, 2026 02:0956,981494,774,671469,940,0002,999,0002,277,376
6Feb 18, 2026 02:0956,986496,373,322470,986,0001,999,0002,281,472
7Feb 18, 2026 02:0957,003501,034,148471,127,0002,000,0002,281,472
8Feb 18, 2026 02:0957,005498,583,999471,141,0002,000,0002,281,472
9Feb 18, 2026 02:0957,026495,823,912472,317,0001,000,0002,281,472