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 9, 2025 02:41Ian MckibbenIan MckibbenScore: 90,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 02:4190,362770,453,707748,002,0002,000,0002,281,472
2Jan 9, 2025 02:4190,386779,445,395750,205,00002,289,664
3Jan 9, 2025 02:4190,445776,083,696748,694,0001,999,0002,289,664