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 17, 2023 21:00Kevin HeaveyKevin HeaveyScore: 138,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2023 20:53138,7341,226,870,9501,151,492,28902,224,128
2Jan 17, 2023 20:53138,7531,213,130,0611,151,645,87702,224,128
3Jan 17, 2023 21:00138,8141,207,484,5371,152,152,37202,228,224
4Jan 17, 2023 20:53138,8211,212,449,9431,152,212,80802,215,936
5Jan 17, 2023 21:00138,9401,212,413,0871,153,203,71202,215,936
6Jan 17, 2023 21:00139,0391,209,201,2391,154,023,07402,215,936