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 11, 2025 23:37Ian MckibbenIan MckibbenScore: 99,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 23:3799,006844,238,953653,803,000167,949,0002,326,528
2Jan 11, 2025 23:3799,056848,218,876649,339,000172,824,0002,293,760
3Jan 11, 2025 23:3799,283850,636,297639,262,000184,786,0002,273,280