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 8, 2025 23:41Ian MckibbenIan MckibbenScore: 56,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2025 23:4156,523492,140,021468,143,0001,000,0002,289,664
2Jan 8, 2025 23:4156,536491,522,267468,246,0001,000,0002,269,184
3Jan 8, 2025 23:4156,538495,860,627468,262,0001,000,0002,281,472
4Jan 8, 2025 23:4156,539492,030,427468,276,0001,000,0002,289,664
5Jan 8, 2025 23:4156,540496,572,476468,279,0001,000,0002,523,136
6Jan 8, 2025 23:4156,554492,889,256468,402,0001,000,0002,273,280
7Jan 8, 2025 23:4156,565502,915,736467,496,0001,997,0002,289,664
8Jan 8, 2025 23:4156,567499,541,537467,509,0001,997,0002,289,664
9Jan 8, 2025 23:4156,599493,997,248467,773,0001,999,0002,281,472