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 listMay 25, 2025 10:43rogue *rogue *Score: 39,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 10:4339,043350,173,981322,056,0002,000,0002,510,848
2May 25, 2025 10:4339,060349,154,989323,200,0001,000,0002,387,968
3May 25, 2025 10:4339,077347,971,681323,342,0001,001,0002,519,040
4May 25, 2025 10:4339,111355,279,125323,617,0001,001,0002,383,872
5May 25, 2025 10:4339,146349,135,461322,912,0001,999,0002,519,040
6May 25, 2025 10:4339,192355,901,619324,297,0001,000,0002,519,040
7May 25, 2025 10:4339,197347,278,638325,334,00002,371,584
8May 25, 2025 10:4339,260354,145,464322,858,0002,998,0002,392,064
9May 25, 2025 10:4339,526353,158,860326,064,0002,000,0002,375,680