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 23, 2025 19:54Ian MckibbenIan MckibbenScore: 31,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 19:5431,056283,597,823255,763,0001,998,0002,437,120
2Jan 23, 2025 19:5431,057285,072,816256,774,000999,0002,531,328
3Jan 23, 2025 19:5431,057285,070,078255,779,0001,998,0002,433,024
4Jan 23, 2025 19:5431,059285,228,438256,790,000999,0002,433,024
5Jan 23, 2025 19:5431,072282,017,407256,901,000999,0002,433,024
6Jan 23, 2025 19:5431,077279,341,855255,940,0001,999,0002,269,184
7Jan 23, 2025 19:5431,084281,444,004255,999,0001,999,0002,531,328
8Jan 23, 2025 19:5431,121284,167,680258,304,00002,424,832
9Jan 23, 2025 19:5431,184283,428,800256,828,0001,998,0002,531,328